Concerning the characteristics of breast cancer in Magnetic Resonance Imaging （MRI）， such as different shapes and sizes， and fuzzy boundaries， an algorithm based on multiscale residual U Network （UNet） with attention mechanism was proposed in order to avoid error segmentation and improve segmentation accuracy. Firstly， the multiscale residual units were used to replace two adjacent convolution blocks in the down-sampling process of UNet， so that the network could pay more attention to the difference of shape and size. Then， in the up-sampling stage， layer-crossed attention was used to guide the network to focus on the key regions， avoiding the error segmentation of healthy tissues. Finally， in order to enhance the ability of representing the lesions， the atrous spatial pyramid pooling was introduced as a bridging module to the network. Compared with UNet， the proposed algorithm improved the Dice coefficient， Intersection over Union （IoU）， SPecificity （SP） and ACCuracy （ACC） by 2.26， 2.11， 4.16 and 0.05 percentage points， respectively. The experimental results show that the algorithm can improve the segmentation accuracy of lesions and effectively reduce the false positive rate of imaging diagnosis.

In view of the general problems of not fully utilizing historical information and slow parameter optimization process in the research of clustering algorithms， an adaptive classification algorithm based on data field was proposed in combination with edge intelligent computing， which can be deployed on Edge Computing （EC） nodes to provide local intelligent classification service. By introducing supervision information to modify the structure of the traditional data field clustering model， the proposed algorithm enabled the traditional data field to be applied to classification problems， extending the applicable fields of data field theory. Based on the idea of the data field， the proposed algorithm transformed the domain value space of the data into the data potential field space， and divided the data into several unlabeled cluster results according to the spatial potential value. After comparing the cluster results with the historical supervision information for cloud similarity， the cluster results were attributed to the most similar category. Besides， a parameter search strategy based on sliding step length was proposed to speeded up the parameter optimization of the proposed algorithm. Based on this algorithm， a distributed data processing scheme was proposed. Through the cooperation of cloud center and edge devices， classification tasks were cut and distributed to different levels of nodes to achieve modularity and low coupling. Simulation results show that the precision and recall of the proposed algorithm maintained above 96%， and the Hamming loss was less than 0.022. Experimental results show that the proposed algorithm can accurately classify and accelerate the speed of parameter optimization， and outperforms than Logistic Regression （LR） algorithm and Random Forest （RF） algorithm in overall performance.

To deal with the problem that the process of Gas Chromatography-Mass Spectrography (GC-MS) data is complex and time consuming which delays the whole experimental progress, taking the alignment of multiple samples as an example, a parallel framework for processing GC-MS data on Sector/Sphere was proposed, and an algorithm of aligning multiple samples in parallel was implemented. First, the similarity matrix of all the samples was computed, then the sample set was divided into small sample sets according to hierarchical clustering and samples in each set were aligned respectively, finally the results of each set were merged according to the average sample of the set. The experimental results show that the error rate of the parallel alignment algorithm is 2.9% and the speedup ratio reaches 3.29 using the cluster with 4 PC, which can speed up the process at a high accuracy, and handle the problem that the processing time is too long.